Stability-Optimal Grouping Strategy of Peer-to-Peer Systems
نویسندگان
چکیده
منابع مشابه
A Super-Peer Selection Strategy for Peer-to-Peer Systems
A P2P system based on super-peer overlay shows good features of combining both advantages of hybrid and pure P2P systems. Most P2P applications being developed are based on the overlay networks composed of super-peers. Super-peer is a special peer acting as a server to a cluster of client peers. Selecting super-peers and constructing a super-peer overlay for clustering client peers are importan...
متن کاملPeer to Peer Systems
Peer-to-peer systems are bringing Windows-based computers onto the Internet as full participants. Peer-to-peer systems utilize the connectivity and capacity to share resources offered by the Internet without being bound by the constraints imposed by the Domain Name System. Peer to peer systems (P2P) are so named because each computer has the same software as the other – every computer is a peer...
متن کاملPeer-to-Peer Systems
Peer-to-peer technologies (or P2P for short) have broken through in recent years as an attractive alternative to the traditional client-server-based architectures and systems. A lot of the attention paid to peer-to-peer systems has been caused by the widespread use of P2P file sharing networks, where (often illegal) media content is being distributed. Recently deployed peer-to-peer systems howe...
متن کاملPeer-to-Peer Systems
This paper provides a brief introduction to peer-to-peer (P2P) systems. Basic definitions and characteristics of P2P systems are described in Section 1. A comparison of a two related paradigms: P2P and Grid computing is also given. Section 2 classifies P2P substrates into two categories: structured and unstructured. Description of each category along with some examples is provided. A wide range...
متن کاملPeer - to - peer Systems ∗
We consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing approaches to this problem can be modeled as the construction of a random graph embedded in a metric space whose points represent resource identifiers, where the probability of a connection between two nodes depends only o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2011
ISSN: 1045-9219
DOI: 10.1109/tpds.2011.90